Beta-Shape Using Delaunay-Based Triangle Erosion
نویسندگان
چکیده
The aim of this paper is to offer a faster and more rigorous way for calculating the Beta-Shape. The Beta-Shape is a tight-fitting concave polygonal contour, similar to the Alpha Shape, but which remains connected when data points are farther away than the desired resolution. The proposed method uses a computational geometry approach. We also propose an improvement to the original Beta Shape, aimed at generating a more natural flowing geometry. The complexity of the original algorithm are calculated and compared to the complexity of this algorithm. Key-Words: Beta Shape, Alpha Shape, Convex Hull, contour, triangulation, mesh generation, segmentation
منابع مشابه
A non-parametric approach to shape reconstruction from planar point sets through Delaunay filtering
In this paper, we present a fully automatic Delaunay based sculpting algorithm for approximating the shape of a finite set of points S in R2. The algorithm generates a relaxed Gabriel graph (RGG) that consists of most of the Gabriel edges and a few non-Gabriel edges induced by the Delaunay triangulation. Holes are characterized through a structural pattern called as body-arm formed by the Delau...
متن کاملDelaunay triangulation for image object indexing: a novel method for shape representation
Recent research on image databases has been aimed at the development of content-based retrieval techniques for the management of visual information. Compared with such visual information as color, texture, and spatial constraints, shape is so important a feature associated with those image objects of interest that shape alone may be sufficient to identify and classify an object completely and a...
متن کاملMorphological Operations on Delaunay Triangulations
Algorithms are presented which allow to perform morphological transformations on unorganised sets of points represented by their Delaunay triangulation. The results show that these algorithms could behaves as morphological operators such as erosion, dilatation, opening do. As a matter of fact, they actually act as “shape filter”. These algorithms are applied to the problem of scene reconstructi...
متن کامل1B.1 Interleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation
We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay triangulation of the input set of constraints, then interleaves Delaunay refinement and optimization. The refinement stage inserts a subset of the Voronoi vertices and midpoints of constrained edges as Steiner poi...
متن کاملInterleaving Delaunay Refinement and Optimization for 2D Triangle Mesh Generation
We address the problem of generating 2D quality triangle meshes from a set of constraints provided as a planar straight line graph. The algorithm first computes a constrained Delaunay triangulation of the input set of constraints, then interleaves Delaunay refinement and optimization. The refinement stage inserts a subset of the Voronoi vertices and midpoints of constrained edges as Steiner poi...
متن کامل